On Quantum Algorithm for Binary Search and Its Computational Complexity

On Quantum Algorithm for Binary Search and Its Computational Complexity

A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2n objects that our algorithm runs in polynomial time.

Noise effects in the quantum search algorithm from the computational complexity point of view

It is often said that the strength of quantum computation lies in the phenomena of quantum superposition and quantum entanglement. These features of quantum computation allow to perform the computation on all possible inputs that fit to the quantum register. One of the greatest achievements in the theory of quantum algorithms is quantum search algorithm introduced by Grover. The detailed descri...

Noise effects in the quantum search algorithm from the viewpoint of computational complexity

It is often said that the strength of quantum computation lies in the phenomena of quantum superposition and quantum entanglement. These features of quantum computation allow performing the computation on all possible inputs that fit the quantum register. One of the greatest achievements in the theory of quantum algorithms is the quantum search algorithm introduced by Grover. A detailed descrip...

Polynomial Time Quantum Algorithm for Search Problem and Its Application

BQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems

Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...